Well-structured languages

Well-Structured Pushdown Systems

Pushdown systems (PDSs) model single-thread recursive programs, and well-structured transition systems (WSTSs), such as vector addition systems, are useful to represent non-recursive multi-thread programs. Combining these two ideas, our goal is to investigate wellstructured pushdown systems (WSPDSs), pushdown systems with wellquasi-ordered control states and stack alphabet. This paper focuses o...

Structured Communication for Concurrent Languages

I propose higher-level primitives for concurrent programming in Er-lang. The rst construct is for the rather common situation where a message is a request for information, and the receiver of the message is supposed to reply to the sender. The second construct is intended to allow a form of process deenition which appears to be very common in Erlang programs to be expressed in a simpliied form....

Well-Typed Languages are Sound

Type soundness is an important property of modern programming languages. In this paper we explore the idea that well-typed languages are sound : the idea that the appropriate typing discipline over language specifications guarantees that the language is type sound. We instantiate this idea for a certain class of languages defined using small step operational semantics by ensuring the progress a...

Modelling Well-Structured Argumentation Lines

Abstract argumentation systems are formalisms for defeasible reasoning where some components remain unspecified, the structure of arguments being the main abstraction. In the dialectical process carried out to identify accepted arguments in the system some controversial situations may appear. These relate to the reintroduction of arguments into the process which cause the onset of circularity. ...

Well-structured transition systems everywhere!